Constraint Abstractions
نویسندگان
چکیده
Many type based program analyses with subtyping, such as ow analysis, are based on inequality constraints over a lattice. When inequality constraints are combined with polymorphism it is often hard to scale the analysis up to large programs. A major source of ineeciency in conventional implementations stems from computing substitution instances of constraints. In this paper we extend the constraint language with constraint abstractions so that instantiation can be expressed directly in the constraint language and we give a cubic-time algorithm for constraint solving. As an application, we illustrate how a ow analysis with ow subtyping, ow polymorphism and ow-polymorphic recursion can be implemented in O(n 3) time where n is the size of the explicitly typed program.
منابع مشابه
Constructing Problem-speciic Abstractions for Case Adaptation
adapted case case Abstractions: − variables − constraints new specifications constraint solving Figure 1: Abstractions are required for adapting geometric shapes to new speciications.
متن کاملLearning-Based Abstractions for Nonlinear Constraint Solving
We propose a new abstraction refinement procedure based on machine learning to improve the performance of nonlinear constraint solving algorithms on large-scale problems. The proposed approach decomposes the original set of constraints into smaller subsets, and uses learning algorithms to propose sequences of abstractions that take the form of conjunctions of classifiers. The core procedure is ...
متن کاملGlobal planning of several plants
This paper discusses an attempt to solve the problem of planning several pharmaceutical plants at a global level. The interest in planning at this level is to increase the global control over the production process, to improve its overall efficiency and to reduce the need for interaction between production plants. In order to reduce the complexity of this problem and to make it tractable, some ...
متن کاملFeasible Cellular Frequency Assignment Using Constraint Programming Abstractions
The contribution of this paper is twofold. We present a new method for feasible cellular frequency assignment, a hard combinatorial optimization problem from telecommunications. Frequency assignment problems arise when a cellular radio network has to be established. Given a number of base stations, the goal is to assign each a number of frequencies, subject to given interference restrictions. W...
متن کامل